A THRESHOLDED LANDWEBER ITERATION BASED ON SENSING DICTIONARY
نویسندگان
چکیده
منابع مشابه
A shearlet-based fast thresholded Landweber algorithm for deconvolution
Image deconvolution is an important problem which has seen plenty of progress in the last decades. Due to its ill-posedness, a common approach is to formulate the reconstruction as an optimisation problem, regularised by an additional sparsityenforcing term. This term is often modeled as an l1 norm measured in the domain of a suitable signal transform. The resulting optimisation problem can be ...
متن کاملPreconditioning Landweber iteration in Hilbert scales
In this paper we investigate convergence of Landweber iteration in Hilbert scales for linear and nonlinear inverse problems. As opposed to the usual application of Hilbert scales in the framework of regularization methods, we focus here on the case s ≤ 0, which (for Tikhonov regularization) corresponds to regularization in a weaker norm. In this case, the Hilbert scale operator L−2s appearing i...
متن کاملA Compressive Landweber Iteration for Solving Ill-Posed Inverse Problems
In this paper we shall be concerned with the construction of an adaptive Landweber iteration for solving linear ill-posed and inverse problems. Classical Landweber iteration schemes provide in combination with suitable regularization parameter rules order optimal regularization schemes. However, for many applications the implementation of Landweber’s method is numerically very intensive. Theref...
متن کاملThresholded Smoothed- (sl0) Dictionary Learning for Sparse Representations
In this paper, we suggest to use a modified version of Smoothed0 (SL0) algorithm in the sparse representation step of iterative dictionary learning algorithms. In addition, we use a steepest descent for updating the non unit columnnorm dictionary instead of unit column-norm dictionary. Moreover, to do the dictionary learning task more blindly, we estimate the average number of active atoms in t...
متن کاملThresholded smoothed-l0(SL0) dictionary learning for sparse representations
In this paper, we suggest to use a modified version of Smoothed-!0 (SL0) algorithm in the sparse representation step of iterative dictionary learning algorithms. In addition, we use a steepest descent for updating the non unit columnnorm dictionary instead of unit column-norm dictionary. Moreover, to do the dictionary learning task more blindly, we estimate the average number of active atoms in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress In Electromagnetics Research Letters
سال: 2009
ISSN: 1937-6480
DOI: 10.2528/pierl09030903